Section: New Software and Platforms
Timbuk
Keywords: Demonstration - Ocaml - Vérification de programmes - Tree Automata
Functional Description: Timbuk is a collection of tools for achieving proofs of reachability over Term Rewriting Systems and for manipulating Tree Automata (bottom-up non-deterministic finite tree automata)
Release Functional Description: This version does no longer include the tree automata library but focuses on reachability analysis and equational approximations.